Rewriting integer variables into zero-one variables: Some guidelines for the integer quadratic multi-knapsack problem
نویسندگان
چکیده
منابع مشابه
Rewriting integer variables into zero-one variables: Some guidelines for the integer quadratic multi-knapsack problem
This paper is concerned with the integer quadratic multidimensional knapsack problem (QMKP) where the objective function is separable. Our objective is to determine which expansion technique of the integer variables is the most appropriate to solve (QMKP) to optimality using the upper bound method proposed by Quadri et al. (2007). To the best of our knowledge the upper bound method previously m...
متن کاملParameterized Integer Quadratic Programming: Variables and Coefficients
In the Integer Quadratic Programming problem input is an n× n integer matrix Q, an m × n integer matrix A and an m-dimensional integer vector b. The task is to find a vector x ∈ Z minimizing xQx, subject to Ax ≤ b. We give a fixed parameter tractable algorithm for Integer Quadratic Programming parameterized by n+α. Here α is the largest absolute value of an entry of Q and A. As an application o...
متن کاملCutting planes for integer programs with general integer variables
We investigate the use of cutting planes for integer programs with general integer variables. We show how cutting planes arising from knapsack inequalities can be generated and lifted as in the case of 0{1 variables. We also explore the use of Gomory's mixed integer cuts. We address both theoretical and computational issues and show how to embed these cutting planes in a branch-and-bound framew...
متن کاملOne Diophantine inequality with integer and prime variables
*Correspondence: [email protected] 2Department of Mathematics and Information Science, Henan University of Economics and Law, Zhengzhou, 450046, P.R. China Full list of author information is available at the end of the article Abstract In this paper, we show that if λ1, λ2, λ3, λ4 are positive real numbers, at least one of the ratios λi/λj (1≤ i < j≤ 4) is irrational, then the inequality |λ1x2 1 +...
متن کاملCut-Generating Functions for Integer Variables
For an integer linear program, Gomory’s corner relaxation is obtained by ignoring the nonnegativity of the basic variables in a tableau formulation. In this paper, we do not relax these nonnegativity constraints. We generalize a classical result of Gomory and Johnson characterizing minimal cut-generating functions in terms of subadditivity, symmetry, and periodicity. Our result is based on a ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operational Research
سال: 2007
ISSN: 1109-2858,1866-1505
DOI: 10.1007/bf02942392